Combinatorial algorithms
نویسندگان
چکیده
منابع مشابه
Algorithms for Combinatorial Systems
We consider systems of recursively defined combinatorial structures. We present a quadratic iterative method solving these systems when they are well founded. From there, we deduce truncations of the corresponding generating series in quasi-optimal complexity. This iteration transfers to a numerical scheme that converges unconditionally to the values of the generating series inside their disk o...
متن کاملPrimal-Dual Combinatorial Algorithms
Linear program and its duality have long been ubiquitous tools for analyzing NP-hard problems and designing fast approximation algorithms. Plotkin et al proposed a primaldual combinatorial algorithm based on linear duality for fractional packing and covering, which achieves significant speedup on a wide range of problems including multicommodity flow. The key ideas there are: 1) design a primal...
متن کاملApproximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملCombinatorial Optimization Algorithms via Polymorphisms
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP Λ is tractable if and only if there exist certain non-trivial operations known as polymorphisms to combine solutions to Λ to create new ones. In an entirely separate line of work,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1976
ISSN: 0001-8708
DOI: 10.1016/0001-8708(76)90164-x